0.05/0.31	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.10/0.32	% Command    : run_E %s %d THM
0.10/0.53	% Computer : n014.cluster.edu
0.10/0.53	% Model    : x86_64 x86_64
0.10/0.53	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.10/0.53	% Memory   : 8042.1875MB
0.10/0.53	% OS       : Linux 3.10.0-693.el7.x86_64
0.10/0.53	% CPULimit   : 960
0.10/0.53	% WCLimit    : 120
0.10/0.53	% DateTime   : Tue Aug  9 02:43:31 EDT 2022
0.15/0.54	% CPUTime    : 
0.15/0.65	Running higher-order on 8 cores theorem proving
0.15/0.65	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.15/0.65	# Version: 3.0pre003-ho
0.15/0.66	# Preprocessing class: HSSSSMSSMLSNHSN.
0.15/0.66	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.15/0.66	# Starting new_ho_9 with 600s (5) cores
0.15/0.66	# Starting post_as_ho1 with 120s (1) cores
0.15/0.66	# Starting sh1l with 120s (1) cores
0.15/0.66	# Starting post_as_ho10 with 120s (1) cores
0.15/0.66	# post_as_ho10 with pid 18930 completed with status 0
0.15/0.66	# Result found by post_as_ho10
0.15/0.66	# Preprocessing class: HSSSSMSSMLSNHSN.
0.15/0.66	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.15/0.66	# Starting new_ho_9 with 600s (5) cores
0.15/0.66	# Starting post_as_ho1 with 120s (1) cores
0.15/0.66	# Starting sh1l with 120s (1) cores
0.15/0.66	# Starting post_as_ho10 with 120s (1) cores
0.15/0.66	# No SInE strategy applied
0.15/0.66	# Search class: HHUNF-FFSF00-SHSSMFNN
0.15/0.66	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.15/0.66	# Starting new_ho_10 with 65s (1) cores
0.15/0.66	# new_ho_10 with pid 18932 completed with status 0
0.15/0.66	# Result found by new_ho_10
0.15/0.66	# Preprocessing class: HSSSSMSSMLSNHSN.
0.15/0.66	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.15/0.66	# Starting new_ho_9 with 600s (5) cores
0.15/0.66	# Starting post_as_ho1 with 120s (1) cores
0.15/0.66	# Starting sh1l with 120s (1) cores
0.15/0.66	# Starting post_as_ho10 with 120s (1) cores
0.15/0.66	# No SInE strategy applied
0.15/0.66	# Search class: HHUNF-FFSF00-SHSSMFNN
0.15/0.66	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.15/0.66	# Starting new_ho_10 with 65s (1) cores
0.15/0.66	# Preprocessing time       : 0.001 s
0.15/0.66	# Presaturation interreduction done
0.15/0.66	
0.15/0.66	# Proof found!
0.15/0.66	# SZS status Theorem
0.15/0.66	# SZS output start CNFRefutation
0.15/0.66	thf(decl_22, type, current_world: $i).
0.15/0.66	thf(decl_23, type, prop_a: $i > $o).
0.15/0.66	thf(decl_24, type, prop_b: $i > $o).
0.15/0.66	thf(decl_25, type, prop_c: $i > $o).
0.15/0.66	thf(decl_26, type, mfalse: $i > $o).
0.15/0.66	thf(decl_27, type, mtrue: $i > $o).
0.15/0.66	thf(decl_28, type, mnot: ($i > $o) > $i > $o).
0.15/0.66	thf(decl_29, type, mor: ($i > $o) > ($i > $o) > $i > $o).
0.15/0.66	thf(decl_30, type, mand: ($i > $o) > ($i > $o) > $i > $o).
0.15/0.66	thf(decl_31, type, mimpl: ($i > $o) > ($i > $o) > $i > $o).
0.15/0.66	thf(decl_32, type, miff: ($i > $o) > ($i > $o) > $i > $o).
0.15/0.66	thf(decl_33, type, mbox: ($i > $i > $o) > ($i > $o) > $i > $o).
0.15/0.66	thf(decl_34, type, mdia: ($i > $i > $o) > ($i > $o) > $i > $o).
0.15/0.66	thf(decl_35, type, mall: (individuals > $i > $o) > $i > $o).
0.15/0.66	thf(decl_36, type, mexists: (individuals > $i > $o) > $i > $o).
0.15/0.66	thf(decl_37, type, mvalid: ($i > $o) > $o).
0.15/0.66	thf(decl_38, type, msatisfiable: ($i > $o) > $o).
0.15/0.66	thf(decl_39, type, mcountersatisfiable: ($i > $o) > $o).
0.15/0.66	thf(decl_40, type, minvalid: ($i > $o) > $o).
0.15/0.66	thf(decl_41, type, a: $i > $o).
0.15/0.66	thf(decl_42, type, b: $i > $o).
0.15/0.66	thf(decl_43, type, r: $i > $i > $o).
0.15/0.66	thf(decl_44, type, esk1_0: $i).
0.15/0.66	thf(decl_45, type, esk2_0: $i).
0.15/0.66	thf(mimpl, axiom, ((mimpl)=(^[X7:$i > $o, X8:$i > $o]:(mor @ (mnot @ X7) @ X8))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax', mimpl)).
0.15/0.66	thf(mnot, axiom, ((mnot)=(^[X2:$i > $o, X3:$i]:(~((X2 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax', mnot)).
0.15/0.66	thf(mor, axiom, ((mor)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)|(X5 @ X3))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax', mor)).
0.15/0.66	thf(mbox, axiom, ((mbox)=(^[X10:$i > $i > $o, X11:$i > $o, X1:$i]:(![X12:$i]:(((X10 @ X1 @ X12)=>(X11 @ X12)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax', mbox)).
0.15/0.66	thf(mdia, axiom, ((mdia)=(^[X10:$i > $i > $o, X11:$i > $o, X1:$i]:(?[X13:$i]:(((X10 @ X1 @ X13)&(X11 @ X13)))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax', mdia)).
0.15/0.66	thf(mvalid, axiom, ((mvalid)=(^[X11:$i > $o]:(![X15:$i]:((X11 @ X15))))), file('/export/starexec/sandbox2/benchmark/Axioms/LCL008^0.ax', mvalid)).
0.15/0.66	thf(thm, conjecture, (mvalid @ (mimpl @ (mimpl @ (mdia @ r @ a) @ (mbox @ r @ b)) @ (mbox @ r @ (mimpl @ a @ b)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', thm)).
0.15/0.66	thf(c_0_7, plain, ((mimpl)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimpl])).
0.15/0.66	thf(c_0_8, plain, ((mnot)=(^[Z0:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])).
0.15/0.66	thf(c_0_9, plain, ((mor)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)|(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mor])).
0.15/0.66	thf(c_0_10, plain, ((mimpl)=(^[Z0:$i > $o, Z1:$i > $o, Z2:$i]:(((~((Z0 @ Z2)))|(Z1 @ Z2))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
0.15/0.66	thf(c_0_11, plain, ((mbox)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X12:$i]:(((Z0 @ Z2 @ X12)=>(Z1 @ X12)))))), inference(fof_simplification,[status(thm)],[mbox])).
0.15/0.66	thf(c_0_12, plain, ((mdia)=(^[Z0:$i > $i > $o, Z1:$i > $o, Z2:$i]:(?[X13:$i]:(((Z0 @ Z2 @ X13)&(Z1 @ X13)))))), inference(fof_simplification,[status(thm)],[mdia])).
0.15/0.66	thf(c_0_13, plain, ((mvalid)=(^[Z0:$i > $o]:(![X15:$i]:((Z0 @ X15))))), inference(fof_simplification,[status(thm)],[mvalid])).
0.15/0.66	thf(c_0_14, negated_conjecture, ~(![X22:$i]:((~((~(?[X19:$i]:(((r @ X22 @ X19)&(a @ X19))))|![X20:$i]:(((r @ X22 @ X20)=>(b @ X20)))))|![X21:$i]:(((r @ X22 @ X21)=>(~(a @ X21)|(b @ X21))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[thm]), c_0_10]), c_0_11]), c_0_12]), c_0_13])])).
0.15/0.66	thf(c_0_15, negated_conjecture, ![X24:$i, X25:$i]:(((~(r @ esk1_0 @ X24)|~(a @ X24)|(~(r @ esk1_0 @ X25)|(b @ X25)))&((r @ esk1_0 @ esk2_0)&((a @ esk2_0)&~(b @ esk2_0))))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])])).
0.15/0.66	thf(c_0_16, negated_conjecture, ![X1:$i, X3:$i]:(((b @ X3)|~((r @ esk1_0 @ X1))|~((a @ X1))|~((r @ esk1_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.15/0.66	thf(c_0_17, negated_conjecture, (r @ esk1_0 @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_15])).
0.15/0.66	thf(c_0_18, negated_conjecture, ~((b @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.15/0.66	thf(c_0_19, negated_conjecture, ![X1:$i]:((~((r @ esk1_0 @ X1))|~((a @ X1)))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
0.15/0.66	thf(c_0_20, negated_conjecture, (a @ esk2_0), inference(split_conjunct,[status(thm)],[c_0_15])).
0.15/0.66	thf(c_0_21, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_17]), c_0_20])]), ['proof']).
0.15/0.66	# SZS output end CNFRefutation
0.15/0.66	# Parsed axioms                        : 39
0.15/0.66	# Removed by relevancy pruning/SinE    : 0
0.15/0.66	# Initial clauses                      : 27
0.15/0.66	# Removed in clause preprocessing      : 23
0.15/0.66	# Initial clauses in saturation        : 4
0.15/0.66	# Processed clauses                    : 9
0.15/0.66	# ...of these trivial                  : 0
0.15/0.66	# ...subsumed                          : 0
0.15/0.66	# ...remaining for further processing  : 9
0.15/0.66	# Other redundant clauses eliminated   : 0
0.15/0.66	# Clauses deleted for lack of memory   : 0
0.15/0.66	# Backward-subsumed                    : 1
0.15/0.66	# Backward-rewritten                   : 0
0.15/0.66	# Generated clauses                    : 2
0.15/0.66	# ...of the previous two non-redundant : 1
0.15/0.66	# ...aggressively subsumed             : 0
0.15/0.66	# Contextual simplify-reflections      : 0
0.15/0.66	# Paramodulations                      : 2
0.15/0.66	# Factorizations                       : 0
0.15/0.66	# NegExts                              : 0
0.15/0.66	# Equation resolutions                 : 0
0.15/0.66	# Propositional unsat checks           : 0
0.15/0.66	#    Propositional check models        : 0
0.15/0.66	#    Propositional check unsatisfiable : 0
0.15/0.66	#    Propositional clauses             : 0
0.15/0.66	#    Propositional clauses after purity: 0
0.15/0.66	#    Propositional unsat core size     : 0
0.15/0.66	#    Propositional preprocessing time  : 0.000
0.15/0.66	#    Propositional encoding time       : 0.000
0.15/0.66	#    Propositional solver time         : 0.000
0.15/0.66	#    Success case prop preproc time    : 0.000
0.15/0.66	#    Success case prop encoding time   : 0.000
0.15/0.66	#    Success case prop solver time     : 0.000
0.15/0.66	# Current number of processed clauses  : 4
0.15/0.66	#    Positive orientable unit clauses  : 2
0.15/0.66	#    Positive unorientable unit clauses: 0
0.15/0.66	#    Negative unit clauses             : 1
0.15/0.66	#    Non-unit-clauses                  : 1
0.15/0.66	# Current number of unprocessed clauses: 0
0.15/0.66	# ...number of literals in the above   : 0
0.15/0.66	# Current number of archived formulas  : 0
0.15/0.66	# Current number of archived clauses   : 5
0.15/0.66	# Clause-clause subsumption calls (NU) : 3
0.15/0.66	# Rec. Clause-clause subsumption calls : 3
0.15/0.66	# Non-unit clause-clause subsumptions  : 1
0.15/0.66	# Unit Clause-clause subsumption calls : 0
0.15/0.66	# Rewrite failures with RHS unbound    : 0
0.15/0.66	# BW rewrite match attempts            : 0
0.15/0.66	# BW rewrite match successes           : 0
0.15/0.66	# Condensation attempts                : 9
0.15/0.66	# Condensation successes               : 0
0.15/0.66	# Termbank termtop insertions          : 1146
0.15/0.66	
0.15/0.66	# -------------------------------------------------
0.15/0.66	# User time                : 0.005 s
0.15/0.66	# System time              : 0.000 s
0.15/0.66	# Total time               : 0.005 s
0.15/0.66	# Maximum resident set size: 1712 pages
0.15/0.66	
0.15/0.66	# -------------------------------------------------
0.15/0.66	# User time                : 0.007 s
0.15/0.66	# System time              : 0.000 s
0.15/0.66	# Total time               : 0.007 s
0.15/0.66	# Maximum resident set size: 1768 pages
0.15/0.66	EOF